Hierarchical Binary Vector Quantisation Classi ers

نویسندگان

  • M. Neschen
  • Martin Neschen
چکیده

We report on a hierarchical nearest-neighbor classiier algorithm which we conceived for the recognition of handwritten characters. Distances to all classes are used both as a decision criterion in the classiication hierarchy and for generating class membership coeecients. These likelihood values can be easily integrated in a multi-agent cognitive environment. We introduce a new completely binary version of the k-means cluster algorithm and explain how a highly eecient implementation can be achieved using binary patterns. Performances for large character databases are presented.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Vector Quantisation Classi ers for Handwritten Character

The development of a pattern recognition architecture based on vector quantization techniques is presented which is applied to the recognition of handwritten bank forms. After an overview of nearest-neighbor classiication and clustering, a fast completely binary version of the k-means algorithm is introduced and results for large character databases are given. An integration of these methods in...

متن کامل

Ieee Transactions on Signal Processing

|Two training algorithms for self evolving neural networks are discussed for rule based data analysis. E cient classi cation is achieved with less number of automatically added clusters and application data is analysed by interpreting the trained neural network as a fuzzy rule based system. Learning Vector Quantisation algorithm has been modied acquiring the self evolvement character in the pro...

متن کامل

Hierarchical classification and feature reduction for fast face detection with support vector machines

We present a two-step method to speed-up object detection systems in computer vision that use support vector machines as classi ers. In the rst step we build a hierarchy of classi ers. On the bottom level, a simple and fast linear classi er analyzes the whole image and rejects large parts of the background. On the top level, a slower but more accurate classi er performs the nal detection. We pr...

متن کامل

Improving Image Classi cation by Co-training with Multi-modal Features

We explore the use of co-training to improve the performance of image classi cation in the setting where multiple classi ers are used and several types of features are available. Features are assigned to classi ers in an optimal manner using hierarchical clustering with a distance metric based on conditional mutual information. The e ect of increasing the number of classi ers is then evaluated ...

متن کامل

How Far do We Get Using Machine Learning Black-Boxes?

With several good research groups actively working in machine learning (ML) approaches, we have now the concept of self-containing machine learning solutions that oftentimes work out-ofthe-box leading to the concept of ML black-boxes. Although it is important to have such blackboxes helping researchers to deal with several problems nowadays, it comes with an inherent problem increasingly more e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995